A new (n, n) Blockcipher based Hash Function for Short Messages

We propose a new (n, n) double block length hash function where collision and preimage security bound is respectively O ( 2 ) and O ( 2 ) . The strategic point of this scheme is able to handle short message tn (t < 1) bit, which is very significant issue for RFID tag security. It is known that the RFID tag needs to proceed short message but MDC-2, MDC-4, MJH are not properly suitable for meeting this criteria due to their constructions where these schemes can handle message size n bit (n = 128). Additionally the security bound of the proposed scheme is better than other (n, n) blockcipher based hash such as MDC-2, MDC-4, MJH and as well as obtaining higher efficient rate. Keywords-Hash function, Blockcipher, SBL, DBL, Collision resistance, Preimage resistance.